Run-Time Parallelization for Loops
نویسندگان
چکیده
Current parallelizing compilers cannot extract a significant fraction of the available parallelism in a loop if it has a complex and/or statically insuficiently defined access pattern. In this paper, a run-time technique based on insp/exec scheme (inspector phase and executor phase) is proposed for finding parallelism on loops. Our inspector can determine the wavefronts of a loop with any complex indirected array indexing pattern by building DEF-USE table. Experimental results show that the new method can handle any complex data dependence pattern that cannot be handled by the previous research, and also reveals that if the input loop workload is not uniform, an appropriate loop scheduling should be considered for achieving high parallelism.
منابع مشابه
The LRPD Test: Speculative Run–Time Parallelization of Loops with Privatization and Reduction Parallelization
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we advocate a novel framework for their identification: speculatively execute the loop as a doall, and apply a fully parallel data dependence test to determine if it ha...
متن کاملEffects of Parallelism Degree on Run-Time Parallelization of Loops
Due to the overhead for exploiting and managing parallelism, run-time loop parallelization techniques with the aim of maximizing parallelism may not necessarily lead to the best performance. In this paper, we present two parallelization techniques that exploit different degrees of parallelism for loops with dynamic crossiteration dependences. The DOALL approach exploits iterationlevel paralleli...
متن کاملA Feasibility Study of Hardware Speculative Parallelization in Snoop-Based Multiprocessors
Run-time parallelization is a technique for par-allelizing programs with data access patterns dif-cult to analyze at compile time. In this paper we examine the hardware implementation of a run-time parallelization scheme, called speculative parallelization, on snoop-based multiproces-sors. The implementation is based on the idea of embedding dependence checking logic into the cache controller o...
متن کاملTechniques for Speculative Run - Time Parallelization ofLoopsManish
This paper presents a set of new run-time tests for speculative parallelization of loops that defy par-allelization based on static analysis alone. It presents a novel method for speculative array privatization that is not only more eecient than previous methods when the speculation is correct, but also does not require rolling back the computation in case the variable is found not to be privat...
متن کاملExploiting Locality in the Run-Time Parallelization of Irregular Loops
The goal of this work is the efficient parallel execution of loops with indirect array accesses, in order to be embedded in a parallelizing compiler framework. In this kind of loop pattern, dependences can not always be determined at compile-time as, in many cases, they involve input data that are only known at run-time and/or the access pattern is too complex to be analyzed. In this paper we p...
متن کاملHardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many important applications. Unfortunately, known techniques for run-time parallelization are often computationally expensive or not general enough. To address this problem, we propose new hardware support for e cient run-time...
متن کامل